نتایج جستجو برای: Karmarkar 's Algorithm

تعداد نتایج: 1424678  

1986
Philip E. GILL Walter MURRAY Michael A. SAUNDERS J. A. TOMLIN Margaret H. WRIGHT

Interest in linear programming has been intensified recently by Karmarkar 's publication in 1984 of an algorithm that is claimed to be much faster than the simplex method for practical problems. We review classical barrier-function methods for nonlinear programming based on applying a logarithmic transformation to inequality constraints. For the special case of linear programming, the t ransfor...

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

Journal: :Linear Algebra and its Applications 1991

1990
Anil P. Kamath Narendra Karmarkar K. G. Ramakrishnan Mauricio G. C. Resende

We apply the zero-one integer programming algorithm described in Karmarkar [12] and Karmarkar, Resende and Ramakrishnan [13] to solve randomly generated instances of the satisfiability problem (SAT). The interior point algorithm is briefly reviewed and shown to be easily adapted to solve large instances of SAT. Hundreds of instances of SAT (having from 100 to 1000 variables and 100 to 32,000 cl...

Journal: :The European Physical Journal B 2008

Journal: :Computers & Mathematics with Applications 1990

Journal: :CoRR 2008
Stefan Boettcher Stephan Mertens

The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and statistical physics. We analyze the performance of the differencing algorithm on random instances by mapping it to a nonlinear rate equation. Our analysis reveals strong finite size effects that explain why the precise as...

2008
Yoshio Uwano

Abstract. In the paper of Uwano [Czech. J. of Phys., vol.56, pp.1311-1316 (2006)], a gradient system is found on the space of density matrices endowed with the quantum SLD Fisher metric (to be referred to as the quantum information space) that realizes a generalization of a gradient system on the space of multinomial distributions studied by Nakamura [Japan J. Indust. Appl. Math., vol.10, pp.17...

2009
Amrit B. KARMARKAR Indrajeet D. GONJARI Avinash H. HOSMANI Pandurang N. DHABALE Satish B. BHISE

Fenofibrate is more effective drug as compared to other fibrates. But low bioavailability of it is due to its poor aqueous solubility. The purpose of present study was to improve fenofibrate dissolution through its formulation into liquisolid tablets and then to investigate in vitro performance of prepared liquisolid systems. By use of this technique, liquid medications such as solutions or sus...

Journal: :Artif. Intell. 1998
Richard E. Korf

Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The problem is NPcomplete, and is contained in many scheduling applications. Based on a polynomial-time heuristic due to Karmarkar and Karp, we present a new algorithm, called Complete Karmarkar Karp (CKK), that optimally sol...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید